Interacting thermofield doubles and critical behavior in random regular graphs

نویسندگان

چکیده

We discuss numerically the nonperturbative effects in exponential random graphs which are analogue of eigenvalue instantons matrix models. The phase structure with chemical potential for ${C}_{4}$ ${\ensuremath{\mu}}_{4}$ and degree preserving constraint is clarified. first order transition at critical value ${\ensuremath{\mu}}_{4}^{\mathrm{RRG}}$ into bipartite a formation fixed number clusters found ensemble regular (RRG). consider similar mean field version combinatorial quantum gravity based Ollivier graph curvature RRG supplemented hard-core show that ${\ensuremath{\mu}}_{4}^{\mathrm{CRRG}}$ emerging depend on vertex $d$ RRG. For $d=3$ closed ribbon emerges ${\ensuremath{\mu}}_{4}>{\ensuremath{\mu}}_{4}^{\mathrm{CRRG}}$ while $d>3$ isolated or weakly interacting hypercubes gets emerged clear-cut hysteresis. If additional connectedness condition imposed identified as chain coupled hypercubes. Since ground state hypercube thermofield double we suggest dual holographic picture involves multiboundary wormholes. Treating model Hilbert space many-body system patterns fragmentation transition. also briefly comment possible relation to problem interpretation partial deconfinement gauge theories.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Critical percolation on random regular graphs

We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d is fixed and n grows. We prove mean-field behavior around the critical probability pc = 1 d−1 . In particular, we show that there is a scaling window of width n around pc in which the sizes of the largest components are roughly n 2/3 and we describe their limiting joint ...

متن کامل

Critical behavior in inhomogeneous random graphs

We study the critical behavior of inhomogeneous random graphs where edges are present independently but with unequal edge occupation probabilities. We show that the critical behavior depends sensitively on the properties of the asymptotic degrees. Indeed, when the proportion of vertices with degree at least k is bounded above by k−τ+1 for some τ > 4, the largest critical connected component is ...

متن کامل

Colouring Random Regular Graphs

In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular graph asymptotically almost surely (a.a.s.) has chromatic number 4 and that the chromatic number of a random d-regular graph for other d between 5 and 10 inclusive is a.a.s. restricted to a range of two integer values...

متن کامل

Learning Random Regular Graphs

The family of random regular graphs is a classic topic in the realms of graph theory, combinatorics and computer science. In this paper we study the problem of learning random regular graphs from random paths. A random regular graph is generated uniformly at random and in a standard label-guided graph exploration setting, the edges incident from a node in the graph have distinct local labels. T...

متن کامل

Random strongly regular graphs?

Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36,10,4,2), but there are 32548 non-isomorphic graphs with parameters (36,15,6,6). (The first assertion is a special case of a theorem of Shrikhande, while the second is the result of a computer search by McKay and Spence.) In the light of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical review

سال: 2021

ISSN: ['0556-2813', '1538-4497', '1089-490X']

DOI: https://doi.org/10.1103/physrevd.103.106013